Computing Symmetric Nonnegative Rank Factorizations
نویسندگان
چکیده
An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a diagonal principal submatrix of that rank and size with leading cost O(rm) operations in the dense case. The algorithm is based on geometric considerations and is easy to implement. The implications for matrix graphs are also discussed.
منابع مشابه
On Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices
Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...
متن کاملComputing Approximate PSD Factorizations
We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly...
متن کاملNonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices
The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.
متن کاملOptimality, Computation, and Interpretation of Nonnegative Matrix Factorizations
The notion of low rank approximations arises from many important applications. When the low rank data are further required to comprise nonnegative values only, the approach by nonnegative matrix factorization is particularly appealing. This paper intends to bring about three points. First, the theoretical Kuhn-Tucker optimality condition is described in explicit form. Secondly, a number of nume...
متن کاملAlgorithms for Approximate Subtropical Matrix Factorization
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for finding patterns from the data. Rather than using the standard algebra – and the summation of the rank-1 components to build the approximation of the original ma...
متن کامل